Mutual exclusion in fully anonymous shared memory systems

Bounds on Shared Memory for Mutual Exclusion

A Study of Shared-Memory Mutual Exclusion Protocols Using CADP

Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist in the shared-memory setting, such as Peterson’s or Dekker’s well-known protocols. Although the functional correctness of these protoco...

Time Complexity Bounds for Shared-memory Mutual Exclusion

YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...

Computing in Totally Anonymous Asynchronous Shared Memory Systems

In the totally anonymous shared memory model of asynchronous distributed computing, processes have no id's and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some ...

Computing in Totally Anonymous Asynchronous Shared Memory Systems (Extended Abstract)

(within an induction) to prove that for every k, 0 k logN ? 1, there exists an execution of 2 k+1 processes with k rounds and ending with a bivalent connguration. Taking k = logN ? 1 we get the desired lower bound: Theorem13. In the totally anonymous model, the round complexity of a protocol solving binary consensus among N processes is (log N). References 1. K. Abrahamson. On achieving consens...